Thread algebra for poly-threading
نویسندگان
چکیده
منابع مشابه
Thread algebra for sequential poly-threading
Threads as considered in basic thread algebra are primarily looked upon as behaviours exhibited by sequential programs on execution. It is a fact of life that sequential programs are often fragmented. Consequently, fragmented program behaviours are frequently found. In this paper, we consider this phenomenon. We extend basic thread algebra with the barest mechanism for sequencing of threads tha...
متن کاملProbabilistic Thread Algebra
We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced by instruction sequences under execution and services represent the behaviours exhibited by the components of execution environments of instruction sequences. In a paper concerned with probabilistic instruction seque...
متن کاملThread algebra for SANE Virtual Processors
This paper presents a formal approach to the verification and evaluation of a programming/machine model being developed at the University of Amsterdam, called the SANE Virtual Processor (SVP). The model is being used as a basis for designing and programming chip multiprocessors and to support self-adaptive computation. This model can provide solutions for effectively programming distributed mul...
متن کاملTo Thread or Not to Thread: The Impact of Conversation Threading on Online Discussion
Online discussion is essential for the communication and collaboration of online communities. The reciprocal exchange of messages between users that characterizes online discussion can be represented in many different ways. While some platforms display messages chronologically using a simple linear interface, others use a hierarchical (threaded) interface to represent more explicitly the struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2011
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-011-0178-3